On Asymptotically Good Ramp Secret Sharing Schemes
نویسندگان
چکیده
منابع مشابه
On Asymptotically Good Ramp Secret Sharing Schemes
Asymptotically good sequences of linear ramp secret sharing schemes have been intensively studied by Cramer et al. in terms of sequences of pairs of nested algebraic geometric codes [4, 5, 6, 7, 8, 10]. In those works the focus is on full privacy and full reconstruction. In this paper we analyze additional parameters describing the asymptotic behavior of partial information leakage and possibly...
متن کاملStrongly secure ramp secret sharing schemes for general access structures
Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly even in the case that some information about the secret leaks out from some set of shares, and hence, they are more desirable than the weak ramp SS schemes. In this paper, it is shown that for any feasible general acc...
متن کاملOn Secret Sharing Schemes
The concept of secret sharing has been introduced independently by Shamir and Blakley, as a tool to protect a secret from getting exposed or from being lost. It allows a so-called dealer to share a secret among the members of a set P , which are usually called players or participants, in such a way that only certain specified subsets of players are able to reconstruct the secret while smaller s...
متن کاملSecret sharing schemes on graphs
Given a graph G, a perfect secret sharing scheme based on G is a method to distribute a secret data among the vertices of G, the participants, so that a subset of participants can recover the secret if they contain an edge of G, otherwise they can obtain no information regarding the key. The average information rate is the ratio of the size of the secret and the average size of the share a part...
متن کاملOn Proactive Secret Sharing Schemes
This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restriction to the adversary. We first investigate the approach of using commitment to 0 in the renewal phase in order to renew the player’s shares. In the considered model some well known computationally secure protocols (which use th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2017
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e100.a.2699